Combinatorial Branch-and-Bound for the Maximum Weight Independent Set Problem
نویسندگان
چکیده
We describe three combinatorial branch-and-bound solvers for the maximum weight independent set problem. All use weighted clique covers to generate upper bounds, and all branch according to the method of Balas and Yu (1986). One extends and speeds up the method of Babel (1994). A second one employs a modified method from Balas and Yu (1986) to produce clique covers that share structural similarities with those produced by Babel (1994). Each of these improves on its predecessor. A third solver is a hybrid of the other two. It yields the best known results on some graphs
منابع مشابه
A branch-and-price approach for the maximum weight independent set problem
The maximum weight independent set problem (MWISP) is one of the most well-known and wellstudied problems in combinatorial optimization. This paper presents a novel approach to solve MWISP exactly by decomposing the original graph into vertex-induced sub-graphs. The approach solves MWISP for the original graph by solving MWISP on the sub-graphs in order to generate columns for a branch-and-pric...
متن کاملThe Maximum Clique Problem Handbook Of Combinatorial Optimization
The maximum clique problem (MCP) is to determine a sub graph of maximum cardinality. A clique is a The corresponding optimization problem i.e. finding the maximum Maximum Clique Problem. in Handbook of Combinatorial. Common theme of every optimization problem: of semidefinite programming, A module on combinatorial optimization, Selected topics: The largest clique (i.e., complete subgraph)! In “...
متن کاملA New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...
متن کاملParallel Combinatorial Optimization with Decision Diagrams
We propose a new approach for parallelizing search for combinatorial optimization that is based on a recursive application of approximate Decision Diagrams. This generic scheme can, in principle, be applied to any combinatorial optimization problem for which a decision diagram representation is available. We consider the maximum independent set problem as a specific case study, and show how a r...
متن کاملA combinatorial branch-and-bound algorithm for box search
Considering a set of points in a multi-dimensional space with an associated real value for each point, we want to find the box with the maximum sum of the values of the included points. This problem has applications in data mining and can be formulated as a mixed-integer linear program. We propose a branch-and-bound algorithm where the bounding is obtained by combinatorial arguments instead of ...
متن کامل